package q55_canJump;

public class Solution_2 {
    static double a =  1e5;
    public static void main(String[] args) {
        System.out.println(a);
    }

    public boolean canJump(int[] nums) {
        int n = nums.length;
        int rightmost = 0;

        for (int i = 0; i < n; ++i) {

            if (i <= rightmost) {
                rightmost = Math.max(rightmost, i + nums[i]);
                if (rightmost >= n - 1) {
                    return true;
                }

            }
        }
        return false;

    }
}
